On dominating sets whose induced subgraphs have a bounded diameter
نویسندگان
چکیده
منابع مشابه
On dominating sets whose induced subgraphs have a bounded diameter
We study dominating sets whose induced subgraphs have a bounded diameter. Such sets were used in recent papers by Kim et al. and Yu et al. to model virtual backbones in wireless networks where the number of hops required to forward messages within the backbone is minimized. We prove that for any fixed k ≥ 1 it is NP-complete to decide whether a given graph admits a dominating set whose induced ...
متن کاملThe complexity of connected dominating sets and total dominating sets with specified induced subgraphs
Given a graph class G, it is natural to ask (i) whether a given graph G has a connected or a total dominating set whose induced subgraph is a member of G and (ii) whether G has such a set of cardinality at most a given threshold. We give sufficient conditions on G under which these two problems are NP-hard. This condition is fulfilled in a wide variety of classes of graphs.
متن کاملDominating sets whose closed stars form spanning trees
For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If there exists a W such that S(W ) is a tree containing all the vertices of G, then S(W ) is a spanning star tree of G. These and associated notions are related to connected and/or acyclic domin...
متن کاملOn Dominating Even Subgraphs in Cubic Graphs
It is known that a 3-edge-connected graph has a spanning even subgraph in which every component contains at lest five vertices, and the lower bound is best possible. A natural question arises whether we can improve the lower bound by changing the spanning property with the dominating property. In this paper, we show that a 3-edge-connected cubic graph has a dominating even subgraph in which eve...
متن کاملInduced Subgraphs of Bounded Degree and Bounded Treewidth
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in H has degree at most d in G. The order of H depends on t, k, d, and the order of G. With t = k, we obtain large sets of bounded degree vertices. With t = 0, we obtain large independent sets of bounded degree. In both these cases...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.05.030